Matching fields and lattice points of simplices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Volume and Lattice Points of Reflexive Simplices

Using new number-theoretic bounds on the denominators of unit fractions summing up to one, we show that in any dimension d ≥ 4 there is only one d-dimensional reflexive simplex having maximal volume. Moreover, only these reflexive simplices can admit an edge that has the maximal number of lattice points possible for an edge of a reflexive simplex. In general, these simplices are also expected t...

متن کامل

A Closer Look at Lattice Points in Rational Simplices

We generalize Ehrhart’s idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+ 1 rational vertices, we use its description as the intersection of n+ 1 halfspaces, which determine the facets of the simplex. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We ...

متن کامل

Lattice point simplices

We consider simplices in [w” with lattice point vertices, no other boundary lattice points and n interior lattice points, with an emphasis on the barycentric coordinates of the interior points. We completely classify such triangles under unimodular equivalence and enumerate. For example, in a lattice point triangle with exactly one interior point, that point must be the centroid. We discuss the...

متن کامل

Lattice Embedding of Heronian Simplices

A rational triangle has rational edge-lengths and area; a rational tetrahedron has rational faces and volume; either is Heronian when its edge-lengths are integer, and proper when its content is nonzero. A variant proof is given, via complex number GCD, of the previously known result that any Heronian triangle may be embedded in the Cartesian lattice Z; it is then shown that, for a proper trian...

متن کامل

Stabbing simplices by points and flats

The following result was proved by Bárány in 1982: For every d ≥ 1 there exists cd > 0 such that for every n-point set S in R d there is a point p ∈ R contained in at least cdn d+1 −O(n) of the d-dimensional simplices spanned by S. We investigate the largest possible value of cd. It was known that cd ≤ 1/(2(d+ 1)!) (this estimate actually holds for every point set S). We construct sets showing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2020

ISSN: 0001-8708

DOI: 10.1016/j.aim.2020.107232